4-connected Triangulations and 4-orderedness
نویسندگان
چکیده
For a positive integer k ≥ 4, a graph G is called k-ordered, if for any ordered set of k distinct vertices of G, G has a cycle that contains all the vertices in the designated order. Goddard [3] showed that every 4-connected triangulation of the plane is 4-ordered. In this paper, we improve this result; every 4-connected triangulation of any surface is 4-ordered. Our proof is much shorter than the proof by Goddard.
منابع مشابه
On well-covered triangulations: Part II
A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It was proved in an earlier paper [A. Finbow, B. Hartnell, R. Nowakowski, M. Plummer, On well-covered triangulations: Part I, Discrete Appl. Math., 132, 2004, 97–108] that there are no 5-connected planar w...
متن کاملA bijection for essentially 4-connected toroidal triangulations
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...
متن کاملThe (3, 1)-ordering for 4-connected planar triangulations
Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an (r, s)-canonical order, which unifies many of the existing variants of canonical orderings. We then show that (3, 1)-canonical ordering for 4-connected triangulations always exist; to our knowledge this variant of canonical ordering was not prev...
متن کاملTransversal Structures on Triangulations, with Application to Straight-Line Drawing
We define and investigate so-called transversal structures related to triangulations without separating triangles, which are equivalent to the regular edge labelings discovered by Kant and He. We study other properties of transversal structures and show that they give rise to a new straight-line drawing algorithm for triangulations without separating triangles, and more generally for 4-connecte...
متن کاملThe Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected
We study the graph of bistellar ips between triangulations of a vector connguration A with d + 4 elements in rank d + 1 (i.e. with corank 3), as a step in the Baues problem. We prove that the graph is connected in general and 3-connected for acyclic vector conngurations, which include all point conngurations of dimension d with d + 4 elements. Hence, every pair of triangulations can be joined b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010